On uniformly resolvable (C4,K1,3)(C_4,K_{1,3})-designs

In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus a 1-factor $(K_v − I)$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes consist of either 4-cycles or 3-stars

Maximum uniformly resolvable decompositions of K<inf>v</inf> and K<inf>v</inf> - I into 3-stars and 3-cycles

Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article we investigate uniformly resolvable decompositions of Kv and Kv - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum. © 2014 Elsevier B.V

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths. (C) 2011 Wiley Periodicals, Inc. J Combin Designs 19: 455-462, 201

On uniformly resolvable (C4,K1,3)(C_4,K_{1,3})-designs

In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus a 1-factor $(K_v − I)$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes consist of either 4-cycles or 3-stars

Orthogonal trades and the intersection problem for orthogonal arrays

This work provides an orthogonal trade for all possible volumes (Formula presented.) for block size 4. All orthogonal trades of volume (Formula presented.) are classified up to isomorphism for this block size. The intersection problem for orthogonal arrays with block size 4 is solved for all but finitely many possible exceptions